New Method for Grid Computing Resource Discovery with Dynamic Structure of Peer-To-Peer Model Based on Learning Automata

نویسندگان

  • Ali Sarhadi
  • Ali Yousefi
  • Ali Broumandnia
چکیده

The term "Grid" has become common parlance among parallel and distributed computer scientists to denote a middleware infrastructure for wide-area scientific and engineering computing. Information services are a vital part of any Grid software infrastructure, providing fundamental mechanisms for discovery and monitoring and thus for planning and adapting application behavior. Grid Information Service (GIS) stores information about the resources of a distributed computing environment and answer questions about it. So GIS has a key role in other grid computing services such as resource discovery service. Various kinds of solutions to organization of GIS have been suggested, in this paper we proposed dynamic structure of GIS based on peer-to-peer model using learning automata. Using learning automata is to increase efficiency of proposed model and generate dynamic structuring of peer-to-peer organization for GIS.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proffering a New Method for Grid Computing Resource Discovery with Improved Genetic Algorithm by Means of Learning Automata Based on Economic Criteria

Submitted: Oct 9, 2013; Accepted: Nov 11, 2013; Published: Nov 19, 2013 Abstract: Grid computing offers an effective way to build high-performance computing systems, allowing users to efficiently access and integrate geographically distributed computers, data and applications. Grid computing and peer-to-peer computing are both hot topics at present. The convergence of the two systems is increas...

متن کامل

Weighted-HR: An Improved Hierarchical Grid Resource Discovery

Grid computing environments include heterogeneous resources shared by a large number of computers to handle the data and process intensive applications. In these environments, the required resources must be accessible for Grid applications on demand, which makes the resource discovery as a critical service. In recent years, various techniques are proposed to index and discover the Grid resource...

متن کامل

Proffering a new Method for Grid Computing Resource Discovery based on Economic Criteria using Ant Colony Algorithm

In computational grids, heterogeneous resources with different ownerships are dynamically available and distributed geographically. Resource discovery is one of the most important services of grid computing. Resource Discovery service provides mechanisms to identify the set of resources that are capable of satisfying the job requirements. It is not realistic to build the resource discovery mech...

متن کامل

Efficient resource discovery in grids and P2P networks

Presents a new model for resource discovery in grids and peerto-peer networks designed to utilise efficiently small numbers of messages for query processing and building of the network. Outlines and evaluates the model through a theoretical comparison with other resource discovery systems and a mathematical analysis of the number of messages utilised in contrast with Chord, a distributed hash t...

متن کامل

Peer-to-peer protocols and grid services for resource discovery on grids

Resource discovery is a key issue in Grid environments, since applications are usually constructed by composing hardware and software resources that need to be found and selected. Classical approaches to Grid resource discovery, based on centralized or hierarchical approaches, do not guarantee scalability in large-scale, dynamic Grid environments. On the other hand, the Peer-to-Peer (P2P) parad...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013